PREP
DOOR
Explore
Mock Test
All India Test
Test Package
Topic-wise Test
Android App
X Close
Home
Profile
Explore
PrepDoor
New
My Assets
Crypt Hunt
Word List
Login |
Register
Select an option to search:
GPL Search
Google Custom Search
PSU Papers
Company Papers
Companies Fact
Online Test
Prep Tool
MBA Question
Gate Question
IES Question
Exam Papers:
TCS
Infosys
Wipro
IBM
Accenture
Patni
CTS
Sapient
Aricent
HCL
Syntel
3i Infotech
L&T Infotech
Capgemini
ITC Infotech
You need to enable javascript to view this page properly.
Company
All
CIL
ECIL
EIL
ONGC
SAIL
All
C Programming
Computer Fundamentals
Data Structure
DBMS
Operating System
Software Engineering
Technical
Loading
13.
If every node u in G is adjacent to every other node v in G, A graph is said to be
A. isolated
B. complete
C. finite
D. strongly connected
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
14.
In a graph if e=(u, v) means
A. u is adjacent to v but v is not adjacent to u
B. e begins at u and ends at v
C. u is processor and v is successor
D. both b and c
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
15.
A connected graph T without any cycles is called
A. a tree graph
B. free tree
C. a tree
D. All of above
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
16.
In a graph if e=[u, v], Then u and v are called
A. endpoints of e
B. adjacent nodes
C. neighbors
D. all of above
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
17.
In a Heap tree
A. Values in a node is greater than every value in left sub tree and smaller than right sub tree
B. Values in a node is greater than every value in children of it
C. Both of above conditions applies
D. None of above conditions applies
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
18.
The in order traversal of tree will yield a sorted listing of elements of tree in
A. Binary trees
B. Binary search trees
C. Heaps
D. None of above
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
32
‹‹
1
2
3
4
5
››
... 6
High Frequency Word List with Mnemonics
GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).
Check Now